A fast encoding method without search for fractal image compression

نویسندگان

  • In Kwon Kim
  • Rae-Hong Park
چکیده

A fast coding algorithm for images using vector quantization (VQ) and pixelwise fractal approximation is proposed. The low frequency component of an input image is approximated and its residual is used to calculate the scaling factor of fractal transform. The scaling factor is compressed by transform VQ (TVQ). In the proposed method, lo encode a digital image by an iterated function system (IFS), we USC the pixel-based IFS (PIPS) rather than the block-based IFS: the scaling factor is computed for each pixel. In the proposed method, the scaling factor of each pixel is calculated with the constraint of contraction mapping and it is transformed by wavelet and quantized by VQ. For approximation of an original image, the variable block-size segmentation using quadtrce is employed. Because the proposed method calculates the scaling factor using the PIPS, the encoding time is faster than the conventional algorithm using.block-based IFS with starch.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Fractal Image Coding using Fast Fourier Transform

The fractal coding is a novel technique for image compression. Though the technique has many attractive features, the large encoding time makes it unsuitable for real time applications. In this paper, an efficient algorithm for fractal encoding which operates on entire domain image instead of overlapping domain blocks is presented.The algorithm drastically reduces the encoding time as compared ...

متن کامل

Accelerating Fractal Image Compression by Multi-Dimensional Nearest Neighbor Search

In fractal image compression the encoding step is computationally expensive. A large number of sequential searches through a list of domains (portions of the image) are carried out while trying to find a best match for another image portion. Our theory developed here shows that this basic procedure of fractal image compression is equivalent to multi-dimensional nearest neighbor search. This res...

متن کامل

Fractal Image Compression via Nearest Neighbor Search

In fractal image compression the encoding step is computationally expensive. A large number of sequential searches through a list of domains (portions of the image) are carried out while trying to find best matches for other image portions called ranges. Our theory developed here shows that this basic procedure of fractal image compression is equivalent to multi-dimensional nearest neighbor sea...

متن کامل

Contrast Prediction for Fractal Image Compression

In this paper, a fast encoding algorithm is developed for Fractal Image Compression. At each search entry in the domain pool, by using the predicted contrast coefficients, we simplify the calculations for the contrast and brightness parameters. The redundant computations of eight dihedral symmetries of the domain block are also eliminated in the new encoding algorithm. Experimental results show...

متن کامل

A fast encoding algorithm for fractal image compression using the DCT inner product

In this paper, a fast encoding algorithm is developed for fractal image compression. At each search entry in the domain pool, the mean square error (MSE) calculations of the given range block and the eight dihedral symmetries of the domain block are obtained simultaneously in the frequency domain, in which the redundant computations are all eliminated in the new encoding algorithm. It is shown ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998